 #include"SortingClass.h"
#include"ListQuickSort.h"
#include<iostream>
using namespace std;

void PrintArray(int *pArray, int nSize)
{
	if (pArray==NULL || nSize<=0)
		return;
	for (int i=0; i<nSize; i++)
		cout<<pArray[i]<<"  ";
}

int main()
{
	int  array_double[5]={6,4,3,2,5};
	//SortingClass::BubbleSort1(array_double, 5);
	//SortingClass::BubbleSort2(array_double, 5);
	
	SortingClass::SelectSort(array_double, 5);

	//SortingClass::ShellSort(array_double, 5);
	
	//SortingClass::QuickSort( array_double, 0, 4);
	
	//SortingClass::MergeSort(array_double, 5);

	//SortingClass::HeapSort(array_double,5);

	//cout<<SortingClass::FindKthMin(array_double,0,4,3)<<endl;

	PrintArray(array_double, 5);

	//TestListQuick();

	cin.get();
	return 0;
}